Distributed Storage Codes with Multiple Replication Degrees Using Relative Difference Families

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

متن کامل

Finite groups with three relative commutativity degrees

‎‎For a finite group $G$ and a subgroup $H$ of $G$‎, ‎the relative commutativity degree of $H$ in $G$‎, ‎denoted by $d(H,G)$‎, ‎is the probability that an element of $H$ commutes with an element of $G$‎. ‎Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$‎. ‎It is shown that a finite group $G$ admits three relative commutativity degrees if a...

متن کامل

Subspace Codes and Distributed Storage Codes

1 Abbreviations and Notations 2 A Note for the Reader 3

متن کامل

Quasi-cyclic LDPC codes from difference families

We consider in this paper regular and nearly regular quasi-cyclic low-density paritycheck (LDPC) codes, derived from families of difference sets. The codes have girth at least 6, and sparse parity-check matrices. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding.

متن کامل

Exact-Regeneration Distributed Storage Codes

Characterizing the exact repair storage-vs-repair bandwidth tradeoff for distributed storage systems remains an open problem for more than five storage nodes. Motivated by the prevalence and practical applicability of linear codes, the exact repair problem when restricted to linear codes is considered. The main result of this paper is a new approach to develop bounds for exact repair distribute...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Korean Institute of Communications and Information Sciences

سال: 2016

ISSN: 1226-4717

DOI: 10.7840/kics.2016.41.12.1768